Nonstandard Gaussian quadrature formulae based on operator values
نویسندگان
چکیده
In this paper, we develop the theory of so-called nonstandard Gaussian quadrature formulae based on operator values for a general family of linear operators, acting of the space of algebraic polynomials, such that the degrees of polynomials are preserved. Also, we propose a stable numerical algorithm for constructing such quadrature formulae. In particular, for some special classes of linear operators we obtain interesting explicit results connected with theory of orthogonal polynomials.
منابع مشابه
A Characterization of Positive Quadrature Formulae
A positive quadrature formula with n nodes which is exact for polynomials of degree In — r — 1, 0 < r < « , is based on the zeros of certain quasi-orthogonal polynomials of degree n . We show that the quasi-orthogonal polynomials that lead to the positive quadrature formulae can all be expressed as characteristic polynomials of a symmetric tridiagonal matrix with positive subdiagonal entries. A...
متن کاملOn Gautschi's conjecture for generalized Gauss-Radau and Gauss-Lobatto formulae
Recently, Gautschi introduced so-called generalized Gauss-Radau and Gauss-Lobatto formulae which are quadrature formulae of Gaussian type involving not only the values but also the derivatives of the function at the endpoints. In the present note we show the positivity of the corresponding weights; this positivity has been conjectured already by Gautschi. As a consequence, we establish several ...
متن کاملKronrod extensions with multiple nodes of quadrature formulas for Fourier coefficients
We continue with analyzing quadrature formulas of high degree of precision for computing the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials, started recently by Bojanov and Petrova [Quadrature formulae for Fourier coefficients, J. Comput. Appl. Math. 231 (2009), 378–391] and we extend their results. Construction of new Gaussian quadrature form...
متن کاملExplicit barycentric weights for polynomial interpolation in the roots or extrema of classical orthogonal polynomials
Barycentric interpolation is arguably the method of choice for numerical polynomial interpolation. The polynomial interpolant is expressed in terms of function values using the so-called barycentric weights, which depend on the interpolation points. Few explicit formulae for these barycentric weights are known. In [H. Wang and S. Xiang, Math. Comp., 81 (2012), 861–877], the authors have shown t...
متن کاملOn Some Gauss and Lobatto Based Integration Formulae
1. Introduction. The economy of the Gaussian quadrature formulae for carrying out numerical integration is to some extent reduced by the fact that an increase in the order of the formulae makes no use of previous integrand evaluations. Kronrod [1] has shown how the Gauss formula of degree 2n — 1 can be extended to one of degree 3rc + 2 by making use of the original n Gauss points and an additio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Adv. Comput. Math.
دوره 32 شماره
صفحات -
تاریخ انتشار 2010